Disassortative mixing accelerates consensus in the naming game
نویسندگان
چکیده
In this paper, we study the role of degree mixing in the naming game. It is found that consensus can be accelerated on disassortative networks. We provide a qualitative explanation of this phenomenon based on clusters statistics. Compared with assortative mixing, disassortative mixing can promote the merging of different clusters, thus resulting in a shorter convergence time. Other quantities, including the evolutions of the success rate, the number of total words and the number of different words, are also studied. PACS numbers: 89.75.Hc, 89.65.-s, 05.65.+b
منابع مشابه
Consensus Dynamics in a non-deterministic Naming Game with Shared Memory
In the naming game, individuals or agents exchange pairwise local information in order to communicate about objects in their common environment. The goal of the game is to reach a consensus about naming these objects. Originally used to investigate language formation and self-organizing vocabularies, we extend the classical naming game with a globally shared memory accessible by all agents. Thi...
متن کاملAn SIS epidemiology game with two subpopulations.
There is significant current interest in the application of game theory to problems in epidemiology. Most mathematical analyses of epidemiology games have studied populations where all individuals have the same risks and interests. This paper analyses the rational-expectation equilibria in an epidemiology game with two interacting subpopulations of equal size where decisions change the prevalen...
متن کاملNaming Game on Networks: Let Everyone be Both Speaker and Hearer
To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios....
متن کاملDisassortative Degree Mixing and Information Diffusion for Overlapping Community Detection in Social Networks (DMID)
In this paper we propose a new two-phase algorithm for overlapping community detection (OCD) in social networks. In the first phase, called disassortative degree mixing, we identify nodes with high degrees through a random walk process on the row-normalized disassortative matrix representation of the network. In the second phase, we calculate how closely each node of the network is bound to the...
متن کاملThe Naming Game in Social Networks: Community Formation and Consensus Engineering
We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat. Mech.: Theory Exp. P06014] in empirical social networks. This stylized agent-based model captures essential features of agreement dynamics in a network of autonomous agents, corresponding to the development of shared classification schemes in a network of artificial agents or opinion spreading and social dynamics in s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1503.00146 شماره
صفحات -
تاریخ انتشار 2015